Turning High-Level Live Sequence Charts into Automata

Turning High-Level Live Sequence Charts into Automata

A (max,+) Approach for Time in Message Sequence Charts

This paper details an approach for studying time in Message Sequence Charts (MSCs). MSCs are rst transformed into order automata, and then into (max,+) automata, which allows for the use of well known (max,+) techniques.

Using live sequence charts for hardware protocol specification and compliance verification

Interface standard specification documents are notoriously difficult to read and interpret consistently. The advent of the system-on-chip design paradigm compounds the problem as multiple vendors attempt to interpret the standard consistently. Monitors, while popular for formal and semiformal verification, do not offer a readable, high-level description. We propose using Live Sequence Charts to...

Realizability of high-level message sequence charts: closing the gaps

We study the notion of safe realizability for high-level message sequence charts (HMSCs) (Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Crete (Greece), Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 797–808). We show that safe realizability is EXPSPACE-complete for bounded HMSCs but undecidable for the class of a...

Modal Scenarios as Automata

Scenario-based modeling in live sequence charts (LSC) involves specifying multi-modal inter-object scenarios, in which events can be mandatory (hot) or possible (cold). In translating LSCs into automata over infinite words, an intermediate step constructs a kind of transition system that we call a modal state structure (MSS). Here we present MSSs as abstract forms of modal scenarios (with both ...